Performance of the Triangulation-based Methods of Positivity-preserving Scattered Data Interpolation
نویسنده
چکیده
We present the result and accuracy comparison of generalized positivitypreserving schemes for triangular Bézier patches of 1 C and 2 C scattered data interpolants that have been constructed. We compare three methods of 1 C schemes using cubic triangular Bézier patches and one 2 C scheme using quintic triangular Bézier patches. Our test case consists of four sets of node/test function pairs, with node-count ranging from 26 to 100 data points. The absolute maximum and mean errors are computed using 33 33 × evaluation points on a uniform rectangular grid.
منابع مشابه
Constrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملRange restricted positivity-preserving scattered data interpolation
The construction of a range restricted bivariate C ( or G ) interpolant to scattered data is considered in which the interpolant is positive everywhere if the original data are positive. This study is motivated by earlier work in which sufficient conditions are derived on Bézier points in order to ensure that surfaces comprising cubic Bézier triangular patches are always positive and satisfy C ...
متن کاملRange Restricted Positivity-Preserving G Scattered Data Interpolation
Abstract : The construction of a range restricted bivariate G interpolant to scattered data is considered in which the interpolant is positive everywhere if the original data are positive. This study is motivated by earlier work in which sufficient conditions are derived on Bézier points in order to ensure that surfaces comprising quartic Bézier triangular patches are always positive and satisf...
متن کاملConvexity-preserving Interpolation of Scattered Data
We describe a detailed computational procedure which, given data values at arbitrarily distributed points in the plane, determines if the data are convex and, if so, constructs a smooth convex surface that interpolates the data. The method consists of constructing a triangulation of the nodes (data abscissae) for which the triangle-based piecewise linear interpolant is convex, computing a set o...
متن کاملMonotonicity Preserving Approximation of Multivariate Scattered Data ∗
This paper describes a new method of monotone interpolation and smoothing of multivariate scattered data. It is based on the assumption that the function to be approximated is Lipschitz continuous. The method provides the optimal approximation in the worst case scenario and tight error bounds. Smoothing of noisy data subject to monotonicity constraints is converted into a quadratic programming ...
متن کامل